Validation of Solutions of Construction Problems in Dynamic Geometry Environments

نویسندگان

  • Gabriel J. Stylianides
  • Andreas J. Stylianides
چکیده

This paper discusses issues concerning the validation of solutions of construction problems in Dynamic Geometry Environments (DGEs) as compared to classic paper-and-pencil Euclidean geometry settings. We begin by comparing the validation criteria usually associated with solutions of construction problems in the two geometry worlds – the ‘drag test’ in DGEs and the use of only straightedge and compass in classic Euclidean geometry. We then demonstrate that the drag test criterion may permit constructions created using measurement tools to be considered valid; however, these constructions prove inconsistent with classical geometry. This inconsistency raises the question of whether dragging is an adequate test of validity, and the issue of measurement versus straightedge-and-compass. Without claiming that the inconsistency between what counts as valid solution of a construction problem in the two geometry worlds is necessarily problematic, we examine what would constitute the analogue of the straightedgeand-compass criterion in the domain of DGEs. Discovery of this analogue would enrich our understanding of DGEs with a mathematical idea that has been the distinguishing feature of Euclidean geometry since its genesis. To advance our goal, we introduce the compatibility criterion, a new but not necessarily superior criterion to the drag test criterion of validation of solutions of construction problems in DGEs. The discussion of the two criteria anatomizes the complexity characteristic of the relationship between DGEs and the paper-and-pencil Euclidean geometry environment, advances our understanding of the notion of geometrical constructions in DGEs, and raises the issue of validation practice maintaining the pace of ever-changing software.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

Robust inter and intra-cell layouts design model dealing with stochastic dynamic problems

In this paper, a novel quadratic assignment-based mathematical model is developed for concurrent design of robust inter and intra-cell layouts in dynamic stochastic environments of manufacturing systems. In the proposed model, in addition to considering time value of money, the product demands are presumed to be dependent normally distributed random variables with known expectation, variance, a...

متن کامل

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

متن کامل

Construction and Validation of a Questionnaire on Metacognitive Knowledge Needed in Solving Mathematical Word Problems to be Used in Interviews

To provide researchers with an instrument, valid and reliable enough, for measuring students’ metacognitive knowledge needed in solving mathematical word problems, based on the theoretical foundation and previous research, a set of 24 questions at three levels of metacognitive knowledge was constructed. The initial validity of these questions was confirmed by Psychology Professors and high scho...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Computers for Math. Learning

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2005